Representation and Inference of Lexicographic Preference Models and Their Variants

نویسندگان

  • Rajeev Kohli
  • Kamel Jedidi
چکیده

T authors propose two variants of lexicographic preference rules. They obtain the necessary and sufficient conditions under which a linear utility function represents a standard lexicographic rule, and each of the proposed variants, over a set of discrete attributes. They then: (i) characterize the measurement properties of the parameters in the representations; (ii) propose a nonmetric procedure for inferring each lexicographic rule from pairwise comparisons of multiattribute alternatives; (iii) describe a method for distinguishing among different lexicographic rules, and between lexicographic and linear preference models; and (iv) suggest how individual lexicographic rules can be combined to describe hierarchical market structures. The authors illustrate each of these aspects using data on personal-computer preferences. They find that two-thirds of the subjects in the sample use some kind of lexicographic rule. In contrast, only one in five subjects use a standard lexicographic rule. This suggests that lexicographic rules are more widely used by consumers than one might have thought in the absence of the lexicographic variants described in the paper. The authors report a simulation assessing the ability of the proposed inference procedure to distinguish among alternative lexicographic models, and between linear-compensatory and lexicographic models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Inference and Computation of Optimal Alternatives for Preference Languages Based On Lexicographic Models

We analyse preference inference, through consistency, for general preference languages based on lexicographic models. We identify a property, which we call strong compositionality, that applies for many natural kinds of preference statement, and that allows a greedy algorithm for determining consistency of a set of preference statements. We also consider different natural definitions of optimal...

متن کامل

Preference Inference Based on Lexicographic Models

With personalisation becoming more prevalent, it can often be useful to be able to infer additional preferences from input user preferences. Preference inference techniques assume a set of possible user preference models, and derive inferences that hold in all models satisfying the inputs; the more restrictive one makes the set of possible user preference models, the more inferences one gets. S...

متن کامل

Importance-based Semantics of Polynomial Comparative Preference Inference Extended Version of ECAI-2012 paper

A basic task in preference reasoning is inferring a preference between a pair of outcomes (alternatives) from an input set of preference statements. This preference inference task for comparative preferences has been shown to be computationally very hard for the standard kind of inference. Recently, a new kind of preference inference has been developed, which is polynomial for relatively expres...

متن کامل

Importance-based Semantics of Polynomial Comparative Peference Inference

A basic task in preference reasoning is inferring a preference between a pair of outcomes (alternatives) from an input set of preference statements. This preference inference task for comparative preferences has been shown to be computationally very hard for the standard kind of inference. Recently, a new kind of preference inference has been developed, which is polynomial for relatively expres...

متن کامل

Obtaining a Unique Solution for the Cross Efficiency by Using the Lexicographic method

Cross efficiency is a method with the idea of peer evaluation instead of self-evaluation, and is used for evaluation and ranking Decision Making Units (DMUs) in Data Envelopment Analysis (DEA). Unlike most existing DEA ranking models which can only rank a subset of DMUs, for example non-efficient or extreme efficient DMUs, cross efficiency can rank all DMUs, even non-extreme ones. However, sinc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007